Restricted arc-connectivity of generalized p-cycles
نویسندگان
چکیده
منابع مشابه
Restricted arc-connectivity of generalized tournaments
If D is a strongly connected digraph, then an arc set S of D is called a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc. Recently, Volkmann [12] defined the restricted arc-connectivity λ(D) as the minimum cardinality over all restricted arc-cuts S. A strongly connected digraph D is called λconnected when λ(D) exists. Let k ≥ 2 be an i...
متن کاملOn the connectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices is partitioned in p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only to vertices in the next part. In this work, we mainly show the two following types of conditions in order to find generalized p-cycles with maximum connectivity: 1. For a new given parameter `, related to the number of short...
متن کاملOn Restricted Arc-connectivity of Regular Digraphs
The restricted arc-connectivity λ′ of a strongly connected digraph G is the minimum cardinality of an arc cut F in G such that every strongly connected component of G−F contains at least two vertices. This paper shows that for a d-regular strongly connected digraph with order n and diameter k ≥ 4, if λ′ exists, then λ′(G) ≥ min { (n − dk−1)(d− 1) dk−1 + d− 2 , 2d− 2 } As consequences, the restr...
متن کاملOn the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only to vertices in the next part. Any digraph can be shown as a p-cycle with p = 1, and bipartite digraphs are generalized p-cycles with p = 2. A maximally connected digraph is said to be superconnected if every disconnect...
متن کاملOn the connectivity and restricted edge-connectivity of 3-arc graphs
A 3 − arc of a graph G is a 4-tuple (y, a, b, x) of vertices such that both (y, a, b) and (a, b, x) are paths of length two in G. Let ←→ G denote the symmetric digraph of a graph G. The 3-arc graph X(G) of a given graph G is defined to have vertices the arcs of ←→ G . Two vertices (ay), (bx) are adjacent in X(G) if and only if (y, a, b, x) is a 3-arc of G. The purpose of this work is to study t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.02.006